Reverse Firewalls for Adaptively Secure MPC Without Setup
نویسندگان
چکیده
منابع مشابه
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
Adaptively secure Multi-Party Computation (MPC) first studied by Canetti, Feige, Goldreich, and Naor in 1996, is a fundamental notion in cryptography. Adaptive security is particularly hard to achieve in settings where arbitrary number of parties can be corrupted and honest parties are not trusted to properly erase their internal state. We did not know how to realize constant round protocols fo...
متن کاملTwo-Round Adaptively Secure MPC from Deniable Obfuscation
We review the two-round statically-secure MPC protocol of [3], and intuitively motivate its construction from smaller building blocks. Then we consider the problems in making this protocol adaptively-secure, and present a proposed solution that slightly modifies the protocol to overcome these problems. In the process, we introduce the notion of “Deniable Obfuscation”, as an extension of Deniabl...
متن کاملAn Adaptively Secure Mix-Net Without Erasures
We construct the first mix-net that is secure against adaptive adversaries corrupting any minority of the mix-servers and any set of senders. The mix-net is based on the Paillier cryptosystem and analyzed in the universal composability model without erasures under the decisional composite residuosity assumption, the strong RSA-assumption, and the discrete logarithm assumption. We assume the exi...
متن کاملMessage Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines
A secure reverse firewall, as recently defined by Mironov and Stephens-Davidowitz, is a third party that “sits between a user and the outside world” and modifies the user’s sent and received messages so that even if the user’s machine has been corrupted, her security is still guaranteed. In other words, reverse firewalls allow us to provide meaningful (and, indeed, very strong) security guarant...
متن کاملFour Round Secure Computation Without Setup
We construct a 4-round multi-party computation protocol in the plain model for any functionality, secure against a malicious adversary. Our protocol relies on the sub-exponential hardness of the Learning with Errors (LWE) problem with slightly super-polynomial noise ratio, and on the existence of adaptively secure commitments. Our round complexity matches a lower bound of Garg et al. (EUROCRYPT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-92075-3_12